Self-Stabilizing Bounded Size Clustering Algorithm

Clustering means partitioning nodes into groups called clusters, providing the network with a hierarchical organization. Overall, clustering increases the scalability of network management. For instance, clustering-based routing reduces the amount of routing information propagated in the network; members of a cluster can share resources; and clustering can be used to reduce the amount of information to store the network state. A self-stabilizing algorithm, regardless of the initial system state, automatically converges to a set of states that satisfy the problem speci cation without external intervention. Due to this property, self-stabilizing algorithms are adapted to highly dynamic networks as ad hoc or sensors networks. From a con guration resulting of topological changes, the system will automatically converge to a con guration consistent with the new topology. In this paper, we present the rst Self-stabilizing Clustering Algorithm where the obtained clusters have a bounded size.